Stationary analysis of the shortest queue problem
نویسندگان
چکیده
منابع مشابه
Stationary analysis of the shortest queue first service policy
We analyze the so-called Shortest Queue First (SQF) queueing discipline whereby a unique server addresses queues in parallel by serving at any time that queue with the smallest workload. Considering a stationary system composed of two parallel queues and assuming Poisson arrivals and general service time distributions, we first establish the functional equations satisfied by the Laplace transfo...
متن کاملAnalysis of the asymmetric shortest queue problem with threshold jockeying
In this paper we study a system consisting of two parallel servers with possibly different service rates. lobs arrive according to a Poisson stream and generate an exponentially distributed workload. On arrival a job joins the shortest queue and in case both queues have equal lengths, he joins the first queue with probability 1 a and the second one with probability a, where a is an arbitrary nu...
متن کاملStationary analysis of the "Shortest Queue First" service policy: the asymmetric case
As a follow-up to a recent paper considering two symmetric queues, the Shortest Queue First service discipline is presently analysed for two general asymmetric queues. Using the results previously established and assuming exponentially distributed service times, the bivariate Laplace transform of workloads in each queue is shown to depend on the solution M to a two-dimensional functional equati...
متن کاملthe problem of divine hiddenness
این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...
15 صفحه اولMatrix-geometric analysis of the shortest queue problem with threshold jockeying
In this paper we study a system consisting of c parallel servers with possibly different service rates. Jobs arrive according to a Poisson stream and generate an exponentially distributed workload. An arriving job joins the shortest queue, where in case of multiple shortest queues, one of these queues is selected according to some arbitrary probability distribution. If the maximum difference be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2017
ISSN: 0257-0130,1572-9443
DOI: 10.1007/s11134-017-9556-8